7 research outputs found
On the Expressiveness and Complexity of ATL
ATL is a temporal logic geared towards the specification and verification of
properties in multi-agents systems. It allows to reason on the existence of
strategies for coalitions of agents in order to enforce a given property. In
this paper, we first precisely characterize the complexity of ATL
model-checking over Alternating Transition Systems and Concurrent Game
Structures when the number of agents is not fixed. We prove that it is
\Delta^P_2 - and \Delta^P_?_3-complete, depending on the underlying multi-agent
model (ATS and CGS resp.). We also consider the same problems for some
extensions of ATL. We then consider expressiveness issues. We show how ATS and
CGS are related and provide translations between these models w.r.t.
alternating bisimulation. We also prove that the standard definition of ATL
(built on modalities "Next", "Always" and "Until") cannot express the duals of
its modalities: it is necessary to explicitely add the modality "Release".Comment: 25 page
Using Model Checking for Analyzing Distributed Power Control Problems
Model checking (MC) is a formal verification technique which has been known and still knows a resounding success in the computer science community. Realizing that the distributed power control (PC) problem can be modeled by a timed game between a given transmitter and its environment, the authors wanted to know whether this approach can be applied to distributed PC. It turns out that it can be applied successfully and allows one to analyze realistic scenarios including the case of discrete transmit powers and games with incomplete information. The proposed methodology is as follows. We state some objectives a transmitter-receiver pair would like to reach. The network is modeled by a game where transmitters are considered as timed automata interacting with each other. The objectives are then translated into timed alternating-time temporal logic formulae and MC is exploited to know whether the desired properties are verified and determine a winning strategy.</p
Using Model Checking for Analyzing Distributed Power Control Problems
Model checking (MC) is a formal verification technique which has been known and still knows a resounding success in the computer science community. Realizing that the distributed power control (PC) problem can be modeled by a timed game between a given transmitter and its environment, the authors wanted to know whether this approach can be applied to distributed PC. It turns out that it can be applied successfully and allows one to analyze realistic scenarios including the case of discrete transmit powers and games with incomplete information. The proposed methodology is as follows. We state some objectives a transmitter-receiver pair would like to reach. The network is modeled by a game where transmitters are considered as timed automata interacting with each other. The objectives are then translated into timed alternating-time temporal logic formulae and MC is exploited to know whether the desired properties are verified and determine a winning strategy